Algorithms for Dense Graphs and Networks on the Random Access Computer

Probabilistic Aspects of Computer Science: Distributed Algorithms and Random Graphs

‏‎facilitating lexical access for the fluent production of speech‎‏

‏‎the hypothesis is that recent and frequent exposure to lexical items leads to a more fluent production of speech in terms of rate of speech. to test the hypothesis , a one- way anova experimental design was carried out. 24 senior student of efl participated in a one-way interview test. data analyses revealed that those who were exposed frequently to the lexical items over a week prior to inte...

‏‎faciliting lexical access for the fluent production of speech‎‏

‏‎the hypothesis is that recent and frequent exposure to lexical items leads to a more fluent production of speech in terms of rate of speech. to test the hypothesis,a one-way anova experimental design was carried out. 24 sednior students of efl participated in a one-way interview test. data analyses revealed that those who were exposed frequently to the lexical items over a week prior to inter...

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

Distributed algorithms for random graphs

In this article we study statistical properties of a commonly used network model – an Erdős–Rényi random graph G(n, p). We are interested in the performance of distributed algorithms on large networks, which might be represented by G(n, p). We concentrate on classical problems from the field of distributed algorithms such as: finding a maximal independent set, a vertex colouring, an approximati...